The Non-carbonaceous–Carbonaceous Meteorite Dichotomy
نویسندگان
چکیده
منابع مشابه
The HOD Dichotomy
This paper provides a more accessible account of some of the material from Woodin [4] and [5]. All unattributed results are due to the first author. Recall that 0# is a certain set of natural numbers that codes an elementary embedding j : L → L such that j 6= id L. Jensen’s covering lemma says that if 0# does not exist and A is an uncountable set of ordinals, then there exists B ∈ L such that A...
متن کاملThe Kraepelinian dichotomy.
McDonald et al (2005) investigated the Kraepelinian dichotomy of psychosis using brain imaging. They reported distinct grey matter volumetric deficits in patients with schizophrenia and those with psychotic bipolar I disorder but common white matter abnormalities in the two disorders. Kraepelin distinguished dementia praecox and manic–depressive psychosis on the basis of symptomatology, course ...
متن کاملThe Kraepelinian dichotomy
McDonald et al (2005) investigated the Kraepelinian dichotomy of psychosis using brain imaging. They reported distinct grey matter volumetric deficits in patients with schizophrenia and those with psychotic bipolar I disorder but common white matter abnormalities in the two disorders. Kraepelin distinguished dementia praecox and manic–depressive psychosis on the basis of symptomatology, course ...
متن کاملThe Broken Belt: Meteorite Concentrations
Introduction: Since the first Antarctic meteorite concentrations were discovered more than 25 years ago, many theories regarding the role of iceflow in the production of meteorite concentrations have been put forward , and most agree on the basic principles [1-3]. These models suggest that as the East Antarctic icesheet flows toward the margins of the continent, meteorites randomly located with...
متن کاملThe Dichotomy Theorems
1. The G0 dichotomy A digraph (or directed graph) on a set X is a subset G ⊆ X \ ∆. Given a digraph G on a set X and a subset A ⊆ X, we say that A is G-discrete if for all x, y ∈ A we have (x, y) / ∈ G. Now let sn ∈ 2 be chosen for every n ∈ N such that ∀s ∈ 2<N ∃n s v sn. Then we can define a digraph G0 on 2N by G0 = {(sn0x, sn1x) ∈ 2N × 2N ∣∣ n ∈ N & x ∈ 2N}. Lemma 1. If B ⊆ 2N has the Baire ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Space Science Reviews
سال: 2020
ISSN: 0038-6308,1572-9672
DOI: 10.1007/s11214-020-00675-w